﻿using System;
using System.Linq;
using System.Security.Cryptography;
using System.Collections.Generic;
using System.IO;
using System.Diagnostics;

namespace System.Security.Cryptography
{
    public sealed class AsyncSHA1 : SHA1Managed
    {
        public new void HashCore(byte[] rgb, int ibStart, int cbSize)
        {
            base.HashCore(rgb, ibStart, cbSize);
        }

        public new byte[] HashFinal()
        {
            return base.HashFinal();
        }
    }

    public sealed class AsyncMD4 : MD4Managed
    {
        // Bug: Mono.Security.Cryptography.MD4Managed.HashCore doesn't deal parameter 'ibStart'!
        //      Therefore, I need to create a copy of rgb started with ibStart, then pass it through
        //
        //  2010-7-16, bug was fixed by Sebastien Pouliot 
        //  Refer http://bugzilla.novell.com/show_bug.cgi?id=617909 to find more info
        public new void HashCore(byte[] rgb, int ibStart, int cbSize)
        {
            //if (cbSize > 0 && rgb != null)
            //{
            //    if (ibStart == 0)
            //        base.HashCore(rgb, 0, cbSize);
            //    else
            //    {
            //        byte[] buffer = new byte[cbSize];
            //        Buffer.BlockCopy(rgb, ibStart, buffer, 0, cbSize);
            //        base.HashCore(buffer, 0, cbSize);
            //    }
            //}
            base.HashCore(rgb, ibStart, cbSize);
        }

        public new byte[] HashFinal()
        {
            return base.HashFinal();
        }
    }

    public sealed class AsyncED2K : ED2KManaged
    {
        public new void HashCore(byte[] rgb, int ibStart, int cbSize)
        {
            base.HashCore(rgb, ibStart, cbSize);
        }

        public new byte[] HashFinal()
        {
            return base.HashFinal();
        }
    }

    public abstract class MD4 : HashAlgorithm
    {
        protected MD4()
        {
            // MD4 hash length are 128 bits long
            HashSizeValue = 128;
        }
    }

    public class MD4Managed : MD4
    {
        private uint[] state;
        private byte[] buffer;
        private uint[] count;
        private uint[] x;

        private const int S11 = 3;
        private const int S12 = 7;
        private const int S13 = 11;
        private const int S14 = 19;
        private const int S21 = 3;
        private const int S22 = 5;
        private const int S23 = 9;
        private const int S24 = 13;
        private const int S31 = 3;
        private const int S32 = 9;
        private const int S33 = 11;
        private const int S34 = 15;

        private byte[] digest;

        //--- constructor -----------------------------------------------------------

        public MD4Managed()
        {
            // we allocate the context memory
            state = new uint[4];
            count = new uint[2];
            buffer = new byte[64];
            digest = new byte[16];
            // temporary buffer in MD4Transform that we don't want to keep allocate on each iteration
            x = new uint[16];
            // the initialize our context
            Initialize();
        }

        public override void Initialize()
        {
            count[0] = 0;
            count[1] = 0;
            state[0] = 0x67452301;
            state[1] = 0xefcdab89;
            state[2] = 0x98badcfe;
            state[3] = 0x10325476;
            // Zeroize sensitive information
            Array.Clear(buffer, 0, 64);
            Array.Clear(x, 0, 16);
        }

        protected override void HashCore(byte[] array, int ibStart, int cbSize)
        {
            /* Compute number of bytes mod 64 */
            int index = (int)((count[0] >> 3) & 0x3F);
            /* Update number of bits */
            count[0] += (uint)(cbSize << 3);
            if (count[0] < (cbSize << 3))
                count[1]++;
            count[1] += (uint)(cbSize >> 29);

            int partLen = 64 - index;
            int i = 0;
            /* Transform as many times as possible. */
            if (cbSize >= partLen)
            {
                //MD4_memcpy((POINTER)&context->buffer[index], (POINTER)input, partLen);
                Buffer.BlockCopy(array, ibStart, buffer, index, partLen);
                MD4Transform(state, buffer, 0);

                for (i = partLen; i + 63 < cbSize; i += 64)
                {
                    // MD4Transform (context->state, &input[i]);
                    MD4Transform(state, array, ibStart + i);
                }

                index = 0;
            }

            /* Buffer remaining input */
            //MD4_memcpy ((POINTER)&context->buffer[index], (POINTER)&input[i], inputLen-i);
            Buffer.BlockCopy(array, ibStart + i, buffer, index, (cbSize - i));
        }

        protected override byte[] HashFinal()
        {
            /* Save number of bits */
            byte[] bits = new byte[8];
            Encode(bits, count);

            /* Pad out to 56 mod 64. */
            uint index = ((count[0] >> 3) & 0x3f);
            int padLen = (int)((index < 56) ? (56 - index) : (120 - index));
            HashCore(Padding(padLen), 0, padLen);

            /* Append length (before padding) */
            HashCore(bits, 0, 8);

            /* Store state in digest */
            Encode(digest, state);

            // Zeroize sensitive information.
            Initialize();

            return digest;
        }

        //--- private methods ---------------------------------------------------

        private byte[] Padding(int nLength)
        {
            if (nLength > 0)
            {
                byte[] padding = new byte[nLength];
                padding[0] = 0x80;
                return padding;
            }
            return null;
        }

        /* F, G and H are basic MD4 functions. */
        private uint F(uint x, uint y, uint z)
        {
            return (uint)(((x) & (y)) | ((~x) & (z)));
        }

        private uint G(uint x, uint y, uint z)
        {
            return (uint)(((x) & (y)) | ((x) & (z)) | ((y) & (z)));
        }

        private uint H(uint x, uint y, uint z)
        {
            return (uint)((x) ^ (y) ^ (z));
        }

        /* ROTATE_LEFT rotates x left n bits. */
        private uint ROL(uint x, byte n)
        {
            return (uint)(((x) << (n)) | ((x) >> (32 - (n))));
        }

        /* FF, GG and HH are transformations for rounds 1, 2 and 3 */
        /* Rotation is separate from addition to prevent recomputation */
        private void FF(ref uint a, uint b, uint c, uint d, uint x, byte s)
        {
            a += F(b, c, d) + x;
            a = ROL(a, s);
        }

        private void GG(ref uint a, uint b, uint c, uint d, uint x, byte s)
        {
            a += G(b, c, d) + x + 0x5a827999;
            a = ROL(a, s);
        }

        private void HH(ref uint a, uint b, uint c, uint d, uint x, byte s)
        {
            a += H(b, c, d) + x + 0x6ed9eba1;
            a = ROL(a, s);
        }

        private void Encode(byte[] output, uint[] input)
        {
            for (int i = 0, j = 0; j < output.Length; i++, j += 4)
            {
                output[j] = (byte)(input[i]);
                output[j + 1] = (byte)(input[i] >> 8);
                output[j + 2] = (byte)(input[i] >> 16);
                output[j + 3] = (byte)(input[i] >> 24);
            }
        }

        private void Decode(uint[] output, byte[] input, int index)
        {
            for (int i = 0, j = index; i < output.Length; i++, j += 4)
            {
                output[i] = (uint)((input[j]) | (input[j + 1] << 8) | (input[j + 2] << 16) | (input[j + 3] << 24));
            }
        }

        private void MD4Transform(uint[] state, byte[] block, int index)
        {
            uint a = state[0];
            uint b = state[1];
            uint c = state[2];
            uint d = state[3];

            Decode(x, block, index);

            /* Round 1 */
            FF(ref a, b, c, d, x[0], S11); /* 1 */
            FF(ref d, a, b, c, x[1], S12); /* 2 */
            FF(ref c, d, a, b, x[2], S13); /* 3 */
            FF(ref b, c, d, a, x[3], S14); /* 4 */
            FF(ref a, b, c, d, x[4], S11); /* 5 */
            FF(ref d, a, b, c, x[5], S12); /* 6 */
            FF(ref c, d, a, b, x[6], S13); /* 7 */
            FF(ref b, c, d, a, x[7], S14); /* 8 */
            FF(ref a, b, c, d, x[8], S11); /* 9 */
            FF(ref d, a, b, c, x[9], S12); /* 10 */
            FF(ref c, d, a, b, x[10], S13); /* 11 */
            FF(ref b, c, d, a, x[11], S14); /* 12 */
            FF(ref a, b, c, d, x[12], S11); /* 13 */
            FF(ref d, a, b, c, x[13], S12); /* 14 */
            FF(ref c, d, a, b, x[14], S13); /* 15 */
            FF(ref b, c, d, a, x[15], S14); /* 16 */

            /* Round 2 */
            GG(ref a, b, c, d, x[0], S21); /* 17 */
            GG(ref d, a, b, c, x[4], S22); /* 18 */
            GG(ref c, d, a, b, x[8], S23); /* 19 */
            GG(ref b, c, d, a, x[12], S24); /* 20 */
            GG(ref a, b, c, d, x[1], S21); /* 21 */
            GG(ref d, a, b, c, x[5], S22); /* 22 */
            GG(ref c, d, a, b, x[9], S23); /* 23 */
            GG(ref b, c, d, a, x[13], S24); /* 24 */
            GG(ref a, b, c, d, x[2], S21); /* 25 */
            GG(ref d, a, b, c, x[6], S22); /* 26 */
            GG(ref c, d, a, b, x[10], S23); /* 27 */
            GG(ref b, c, d, a, x[14], S24); /* 28 */
            GG(ref a, b, c, d, x[3], S21); /* 29 */
            GG(ref d, a, b, c, x[7], S22); /* 30 */
            GG(ref c, d, a, b, x[11], S23); /* 31 */
            GG(ref b, c, d, a, x[15], S24); /* 32 */

            HH(ref a, b, c, d, x[0], S31); /* 33 */
            HH(ref d, a, b, c, x[8], S32); /* 34 */
            HH(ref c, d, a, b, x[4], S33); /* 35 */
            HH(ref b, c, d, a, x[12], S34); /* 36 */
            HH(ref a, b, c, d, x[2], S31); /* 37 */
            HH(ref d, a, b, c, x[10], S32); /* 38 */
            HH(ref c, d, a, b, x[6], S33); /* 39 */
            HH(ref b, c, d, a, x[14], S34); /* 40 */
            HH(ref a, b, c, d, x[1], S31); /* 41 */
            HH(ref d, a, b, c, x[9], S32); /* 42 */
            HH(ref c, d, a, b, x[5], S33); /* 43 */
            HH(ref b, c, d, a, x[13], S34); /* 44 */
            HH(ref a, b, c, d, x[3], S31); /* 45 */
            HH(ref d, a, b, c, x[11], S32); /* 46 */
            HH(ref c, d, a, b, x[7], S33); /* 47 */
            HH(ref b, c, d, a, x[15], S34); /* 48 */

            state[0] += a;
            state[1] += b;
            state[2] += c;
            state[3] += d;
        }
    }

    public abstract class ED2K : HashAlgorithm
    {
        protected ED2K()
        {
            // ED2K hash length are 128 bits long
            HashSizeValue = 128;
        }
    }

    public class ED2KManaged : ED2K
    {
        private const int PARTSIZE = 9728000;
        private List<Byte> hashList;
        private AsyncMD4 md4;
        private int ed2kPos;

        protected ED2KManaged()
        {
            hashList = new List<Byte>();
            md4 = new AsyncMD4();
        }

        protected override void HashCore(byte[] array, int ibStart, int cbSize)
        {
            //if (cbSize > PARTSIZE)
            //    throw new Exception("cbSize must be less than " + PARTSIZE);

            //md4.Initialize();
            //hashList.AddRange(md4.ComputeHash(array, ibStart, cbSize));
            int currentPos = ibStart;
            while (cbSize > 0)
            {
                if (ed2kPos + cbSize >= PARTSIZE)
                {
                    var size = PARTSIZE - ed2kPos;
                    md4.HashCore(array, currentPos, size);
                    hashList.AddRange(md4.HashFinal());
                    md4.Initialize();

                    //File.WriteAllText("ed2k.txt", BitConverter.ToString(hashList.ToArray()).Replace("-", "").ToUpper());
                    //Process.Start("ed2k.txt");

                    currentPos += size;
                    cbSize -= size;
                    ed2kPos = 0;
                }
                else
                {
                    var size = cbSize;
                    md4.HashCore(array, currentPos, size);

                    currentPos += size;
                    cbSize -= size;
                    ed2kPos += size;
                }
            }
        }

        protected override byte[] HashFinal()
        {
            //md4.Initialize();
            //return md4.ComputeHash(hashList.ToArray());
            if (ed2kPos > 0)
            {
                hashList.AddRange(md4.HashFinal());
            }

            //File.WriteAllText("ed2k.txt", BitConverter.ToString(hashList.ToArray()).Replace("-", "").ToUpper());
            //Process.Start("ed2k.txt");

            md4.Initialize();
            return md4.ComputeHash(hashList.ToArray());
        }

        public override void Initialize()
        {
            hashList.Clear();
            md4.Initialize();
            ed2kPos = 0;
        }
    }

}
